Progressive Meshes with Controlled Topology Modifications
نویسندگان
چکیده
Due to the rapid evolution of 3D acquisition and modeling methods highly complex and detailed models became ubiquitous. In order to be able to cope with the complexity, concentrated efforts were dedicated to the development of new mesh decimation methods in the recent years. In works of Garland and Heckbert [Garland and Heckbert 1997] and Popović and Hoppe [Popović and Hoppe 1997], the traditional edge contraction operator was generalized to vertex contraction, which allowed for topology modification during the decimation. The vertex contraction facilitates the joining of originally disconnected regions of the mesh by contracting vertices lying in different connected components of the model. While this operation provides considerable topological flexibility during the mesh simplification, in some cases joining of disconnected regions might be desirable only along the boundaries of the model. As a combination of two already available techniques, we present a mesh decimation technique allowing for increased control over topology changes induced by the decimation process. Our method proceeds in essence by applying two types of operators: the well known edge contraction and the vertex-edge contraction introduced recently by Borodin et al [Borodin et al. n. d.]. This facilitates efficient mesh simplification and gradual closing of gaps along the boundaries of the model. The process is controlled by a geometric error and since inverse operations may be implemented for both of the operators, it is conducted in a progressive manner.
منابع مشابه
Progressive Refinement with Topological Simplification: A Theoretical Framework
This paper presents a theoretical framework for progressive refinement of manifold meshes with topological simplification. We demonstrate that topology changes are not intuitive and therefore a great deal of care is necessary for handling topological simplification. We illustrate nonintutive nature of topology changes with several examples. We also show how to use the non-intutive nature of the...
متن کاملTopology Modification of Hexahedral Meshes Using Atomic Dual-based Operations
Topology modification of hexahedral meshes has been considered difficult due to the propagation of topological modifications non-locally. We address this problem by working in the dual of a hexahedral mesh. We prove several relatively simple combinatorial aspects of hex mesh duals, namely that they are both complexes of simple polytopes as well as simple arrangements of pseudo-hyperplanes. We d...
متن کاملCompressed Progressive Meshes
ÐMost systems that support visual interaction with 3D models use shape representations based on triangle meshes. The size of these representations imposes limits on applications for which complex 3D models must be accessed remotely. Techniques for simplifying and compressing 3D models reduce the transmission time. Multiresolution formats provide quick access to a crude model and then refine it ...
متن کاملTruly Selective Refinement of Progressive Meshes
This paper presents a novel selective refinement scheme of progressive meshes. In previous schemes, topology information in the neighborhood of a collapsed edge is stored in the analysis phase. A vertex split or edge collapse transformation is possible in the synthesis phase only if the configuration of neighborhood vertices in the current mesh corresponds to the stored topology information. In...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001